منابع مشابه
Tractable Disjunctive Constraints
Many combinatorial search problems can be expressed as `constraint satisfaction problems', and this class of problems is known to be NP-complete in general. In this paper we investigatèdisjunctive constraints', that is, constraints which have the form of the disjunc-tion of two constraints of speciied types. We show that when the constraint types involved in the disjunction have a certain prope...
متن کاملThe Disjunctive Datalog System DLV
DLV is one of the most successful and widely used answer set programming (ASP) systems. It supports a powerful language extending Disjunctive Datalog with many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, w...
متن کاملInstitut F Ur Informationssysteme Enhancing Disjunctive Datalog by Constraints Enhancing Disjunctive Datalog by Constraints
This paper presents an extension of Disjunctive Datalog (DATALOG _;:) by integrity constraints. These are of two types: strong, that is, classical integrity constraints, and weak, that is, constraints that are satissed if possible. While strong constraints must be satissed, weak constraints express desiderata, that is, they may be violated-actually, their semantics tends to minimize the number ...
متن کاملDatalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
We study the problem of rewriting a Disjunctive Datalog program into an equivalent plain Datalog program (i.e., one that entails the same facts for every dataset). We show that a Disjunctive Datalog program is Datalog rewritable if and only if it can be rewritten into a linear program (i.e., having at most one IDB body atom in each rule), thus providing a novel characterisation of Datalog rewri...
متن کاملMagic Sets for Disjunctive Datalog Programs
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the propagation of query bindings and extends the Magic Set optimization technique (originally defined for non-disjunctive programs). An important feature of disjunctive Datalog programs is nonmonotonicity, which calls f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(99)00066-7